All Linear-Time Congruences for Familiar Operators

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

All Linear-Time Congruences for Familiar Operators

The detailed behaviour of a system is often represented as a labelled transition system (LTS) and the abstract behaviour as a stuttering-insensitive semantic congruence. Numerous congruences have been presented in the literature. On the other hand, there have not been many results proving the absence of more congruences. This publication fully analyses the linear-time (in a well-defined sense) ...

متن کامل

Combinatorial Congruences and ψ-Operators

The ψ-operator for (φ,Γ)-modules plays an important role in the study of Iwasawa theory via Fontaine’s big rings. In this note, we prove several sharp estimates for the ψ-operator in the cyclotomic case. These estimates immediately imply a number of sharp p-adic combinatorial congruences, one of which extends the classical congruences of Fleck (1913) and Weisman (1977). 1 Combinatorial Congruen...

متن کامل

Is There a Spectral Theory for All Bounded Linear Operators?

What Is Spectral Theory? By spectral theory we mean the theory of structure of certain bounded linear operators on a Hilbert space. In a broader sense, the history of spectral theory goes way back to the nineteenth century, when the objects of study used to be infinite systems of linear equations and integral equations. The subject was revolutionized in the late 1920s by von Neumann, when he de...

متن کامل

Restricted linear congruences

In this paper, using properties of Ramanujan sums and of the finite Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence a1x1 + · · · + akxk ≡ b (mod n), with (xi, n) = ti (1 ≤ i ≤ k), where a1, t1, . . . , ak, tk, b, n (n ≥ 1) are arbitrary integers. Some special cases of this problem have been studied in many papers, and h...

متن کامل

Parametric Systems of Linear Congruences

Based on an extended quantifier elimination procedure for discretely valued fields, we devise algorithms for solving multivariate systems of linear congruences over the integers. This includes determining integer solutions for sets of moduli which are all power of a fixed prime, uniform p-adic integer solutions for parametric prime power moduli, lifting strategies for these uniform p-adic solut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2013

ISSN: 1860-5974

DOI: 10.2168/lmcs-9(4:11)2013